Multiscale mixing efficiencies for steady sources

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Huffman code efficiencies for extensions of sources

It is well known that the efficiency of noiseless coding may be improved by coding extensions of the source; for large extensions the efficiency is arbitrarily close to unity. This paper shows that the efficiency is not always improved just by coding the next extension. In some cases the code of a larger extension is markedly less efficient than its predecessor, although always within the theor...

متن کامل

A Multiscale Measure for Mixing

We present a multiscale measure for mixing that is based on the concept of weak convergence and averages the “mixedness” of an advected scalar field at various scales. This new measure, referred to as the MixNorm, resolves the inability of the L variance of the scalar density field to capture small-scale variations when advected by chaotic maps or flows. In addition, the Mix-Norm succeeds in ca...

متن کامل

Multiscale models for fluid mixing

Recent work of the authors and colleagues on the turbulent mixing of compressible fluids is developed and extended with an emphasis on the multiscale aspects of this work. Specifically, we study an interplay between micro and macro aspects of mixing. 2008 Elsevier B.V. All rights reserved.

متن کامل

Stirring up trouble: Multi-scale mixing measures for steady scalar sources

The mixing efficiency of a flow advecting a passive scalar sustained by steady sources and sinks is naturally defined in terms of the suppression of bulk scalar variance in the presence of stirring, relative to the variance in the absence of stirring. These variances can be weighted at various spatial scales, leading to a family of multi-scale mixing measures and efficiencies. We derive a prior...

متن کامل

Multiscale mixing patterns in networks

Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to link to each other. It is a property often found in social networks, manifesting as a higher tendency of links occurring between people of the same age, race, or political belief. Quantifying the level of assortativity or disassortativity (the preference of linking to nodes with different attribut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2006

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.74.025301